- Post algorithm
- авт.алгоритм Поста
English-Russian scientific dictionary. 2008.
Post algorithm
Смотреть что такое "Post algorithm" в других словарях:
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
Algorithm examples — This article Algorithm examples supplements Algorithm and Algorithm characterizations. = An example: Algorithm specification of addition m+n =Choice of machine model:This problem has not been resolved by the mathematics community. There is no… … Wikipedia
Algorithm characterizations — The word algorithm does not have a generally accepted definition. Researchers are actively working in formalizing this term. This article will present some of the characterizations of the notion of algorithm in more detail. This article is a… … Wikipedia
Post–Turing machine — The article Turing machine gives a general introduction to Turing machines, while this article covers a specific class of Turing machines. A Post–Turing machine is a program formulation of an especially simple type of Turing machine, comprising a … Wikipedia
Post-viral cough — A post viral cough is a lingering cough that follows a viral respiratory tract infection, such as a common cold or flu, and lasting more than eight weeks. Post viral cough is a clinically recognized condition represented within the European… … Wikipedia
Goertzel algorithm — The Goertzel algorithm is a digital signal processing (DSP) technique for identifying frequency components of a signal, published by Dr. Gerald Goertzel in 1958. While the general Fast Fourier transform (FFT) algorithm computes evenly across the… … Wikipedia
Cooley-Tukey FFT algorithm — The Cooley Tukey algorithm, named after J.W. Cooley and John Tukey, is the most common fast Fourier transform (FFT) algorithm. It re expresses the discrete Fourier transform (DFT) of an arbitrary composite size N = N 1 N 2 in terms of smaller… … Wikipedia
Cooley–Tukey FFT algorithm — The Cooley–Tukey algorithm, named after J.W. Cooley and John Tukey, is the most common fast Fourier transform (FFT) algorithm. It re expresses the discrete Fourier transform (DFT) of an arbitrary composite size N = N1N2 in terms of smaller DFTs… … Wikipedia
Divide and conquer algorithm — In computer science, divide and conquer (D C) is an important algorithm design paradigm based on multi branched recursion. A divide and conquer algorithm works by recursively breaking down a problem into two or more sub problems of the same (or… … Wikipedia
International Psychopharmacology Algorithm Project — The International Psychopharmacology Algorithm Project (IPAP) is a non profit corporation whose purpose is to enable, enhance, and propagate use of algorithms for the treatment of some Axis I psychiatric disorders. Kenneth O Jobson founded the… … Wikipedia
Watershed segmentation algorithm — A Watershed segmentation algorithm is an algorithm which utilizes watershed segmentation to segment images. [ [http://www.cs.utah.edu/ xwxue/Research/files/watershed.pdf LNCS 3804 Interactive 3D Heart Chamber Partitioning with a New Marker… … Wikipedia
